zagreb, multiplicative zagreb indices and coindices of ‎graphs

نویسندگان

v. ahmadi

department of mathematics, tehran university, tehran, ‎iran. m. r. ‎darafsheh

department of mathematics, shahid chamran university, ahvaz, ‎iran‎. j. ‎hashemi‎

department of mathematics, tehran university, tehran, ‎iran.

چکیده

‎let g=(v,e) be a simple connected graph with vertex set v and edge set e. the first, second and third zagreb indices of g are respectivly defined by: $m_1(g)=sum_{uin v} d(u)^2, hspace {.1 cm} m_2(g)=sum_{uvin e} d(u).d(v)$ and $ m_3(g)=sum_{uvin e}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in g and uv is an edge of g connecting the vertices u and v. recently, the first and second multiplicative zagreb indices of g are defined by: $pm_1(g)=prod_{uin v} d(u)^2$ and $pm_2(g)=prod_{uin v} d(u)^{d(u)}$. the first and second zagreb coindices of g are defined by: $ overline {m_1}(g) =sum_{uvnotin e} ( d(u)+d(v))$ and $ overline {m_2}(g) =sum_{uvnotin e} d(u).d(v)$. the indices $ overline {pm_1}(g) =prod_{uvnotin e} d(u)+d(v)$ and $ overline {pm_2}(g) =prod_{uvnotin e} d(u).d(v)$ , are called the first and second multiplicative zagreb coindices of g, respectively. in this article, we compute the first, second and third zagreb indices and the first and second multiplicative zagreb indices of some classes of dendrimers. the first and second zagreb coindices and the first and second multiplicative zagreb coindices of these graphs are also computed.also, the multiplicative zagreb indices are computed using link of ‎graphs.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Zagreb, multiplicative Zagreb Indices and Coindices of ‎graphs

‎Let G=(V,E) be a simple connected graph with vertex set V and edge set E. The first, second and third Zagreb indices of G are respectivly defined by: $M_1(G)=sum_{uin V} d(u)^2, hspace {.1 cm} M_2(G)=sum_{uvin E} d(u).d(v)$ and $ M_3(G)=sum_{uvin E}| d(u)-d(v)| $ , where d(u) is the degree of vertex u in G and uv is an edge of G connecting the vertices u and v. Recently, the first and second m...

متن کامل

Multiplicative Zagreb Indices and Coindices of Some Derived Graphs

In this note, we obtain the expressions for multiplicative Zagreb indices and coindices of derived graphs such as a line graph, subdivision graph, vertex-semitotal graph, edge-semitotal graph, total graph and paraline graph.

متن کامل

On multiplicative Zagreb indices of graphs

Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1  G and ( ) 2  G , under the name first and second multiplicative Zagreb index, respectively. These are define as     ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...

متن کامل

Hyper Zagreb Indices and Its Coindices of Graphs

For a (molecular) graph, the hyper Zagreb index is defined as HM(G) = ∑ uv∈E(G) (dG(u) + dG(v)) 2 and the hyper Zagreb coindex is defined asHM(G) = ∑ uv/ ∈E(G) (dG(u)+dG(v)) 2. In this paper, the hyper Zagreb indices and its coindices of edge corona product graph, double graph and Mycielskian graph are obtained.

متن کامل

on multiplicative zagreb indices of graphs

todeschini et al. have recently suggested to consider multiplicative variants of additive graphinvariants, which applied to the zagreb indices would lead to the multiplicative zagrebindices of a graph g, denoted by ( ) 1  g and ( ) 2  g , under the name first and secondmultiplicative zagreb index, respectively. these are define as  ( )21 ( ) ( )v v gg g d vand ( ) ( ) ( )( )2 g d v d v gu...

متن کامل

Multiplicative Zagreb Indices of Trees

Let G be a graph with vertex set V (G) and edge set E(G) . The first and second multiplicative Zagreb indices of G are Π1 = ∏ x∈V (G) deg(x) 2 and Π2 = ∏ xy∈E(G) deg(x) deg(y) , respectively, where deg(v) is the degree of the vertex v . Let Tn be the set of trees with n vertices. We determine the elements of Tn , extremal w.r.t. Π1 and Π2 . AMS Mathematics Subject Classification (2000): 05C05, ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید


عنوان ژورنال:
international journal of industrial mathematics

جلد ۹، شماره ۱، صفحات ۴۷-۵۷

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023